package com.wish.client;

import com.wish.algorithm.ShortestPath;

/**
 * Created by suliucheng on 2021/4/16 21:59
 * Directions:
 */
public class ShortestPathClient {
    public static void main(String[] args) {
        int[][] mapArr = ShortestPath.mapArr;
        for (int i = 0; i < ShortestPath.height; i++) {
            for (int j = 0; j < ShortestPath.width; j++) {
                System.out.print(mapArr[i][j] +" ");
            }
            System.out.println();
        }

        new ShortestPath().move();
    }
}
